commun search problem plan success cocktail parti mauro sozio aristid gioni lot research graph mine devot discoveri commun work focus scenario commun discov refer input graph interest applic interest find commun form set node paper studi queri depend variant commun detect problem call commun search problem graph set queri node graph seek find subgraph queri node dens connect motiv measur densiti base minimum degre distanc constraint develop optimum greedi algorithm measur proce character class monoton constraint gener algorithm comput optimum solut satisfi set monoton constraint final modifi greedi algorithm present heurist algorithm find commun size greater upper bound experiment evalu real dataset demonstr effici propos algorithm qualiti solut obtain 